Single and Multiple point Spatial Queries Supporting Keywords for Searching Nearest Neighbors
نویسندگان
چکیده
منابع مشابه
Relaxed Reverse Nearest Neighbors Queries
Given a set of users U , a set of facilities F , and a query facility q, a reverse nearest neighbors (RNN) query retrieves every user u for which q is its closest facility. Since q is the closest facility of u, the user u is said to be influenced by q. In this paper, we propose a relaxed definition of influence where a user u is said to be influenced by not only its closest facility but also ev...
متن کاملExtending range queries and nearest neighbors
Given an initial rectangular range or k nearest neighbor (k-nn) query (using the L1 metric), we consider the problems of incrementally extending the query by increasing the size of the range, or by increasing k, and reporting the new points incorporated by each extension. Although both problems may be solved trivially by repeatedly applying a traditional range query or L1 k-nn algorithm, such s...
متن کاملSearching of Nearest Neighbor Based on Keywords using Spatial Inverted Index
Many search engines are used to search anything from anywhere; this system is used to fast nearest neighbor search using keyword. Existing works mainly focus on finding top-k Nearest Neighbors, where each node has to match the whole querying keywords .It does not consider the density of data objects in the spatial space. Also these methods are low efficient for incremental query. But in intende...
متن کاملSearching k-Nearest Neighbors to be Appropriate under Gamming Environments
In general, algorithms to find continuous k-nearest neighbors have been researched on the location based services, monitoring periodically the moving objects such as vehicles and mobile phone. Those researches assume the environment that the number of query points is much less than that of moving objects and the query points are not moved but fixed. In gaming environments, this problem is when ...
متن کاملPine Based Group K-Nearest Neighbors Queries in Road Networks
A common and important query type in spatial networks is to find the Group KNearest Neighbors “GKNN” of a given query objects set. Given two sets of points P and Q, the result of group Knearest neighbors (GKNN) query is the point(s) of P with the smallest sum of distances to all points in Q. Due to the difficulties and the expense of the required calculations to answer such a query, almost all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/19328-0842